A long-time tail for random walk in random scenery

Consider a simple random walk on ^d whose sites are colored black or white independently with probabilityq, resp. 1–q. Walk and coloring are independent. Letn _k be the number of steps by the walk between itskth and (k+1) th visits to a black site (i.e., the length of itskth white run), and let _k =E(n _k )–q ^–1. Our main result is a proof that (*) lim _k k ^d/2 _k = (1 –q)q ^{d/2 – 2}(d/2) ^d/2. Since it is known thatq ^{– 1} _k =E(n ₁ n _{k + 1} B) –E(n ₁ B)E(n _{k + 1} B), withB the event that the origin is black, (*) exhibits a long-time tail in the run length autocorrelation function. Numerical calculations of _k (1k100) ind=1, 2, and 3 show that there is an oscillatory behavior of _k for smallk. This damps exponentially fast, following which the power law sets in fairly rapidly. We prove that if the coloring is not independent, but is convex in the sense of FKG, then the decay of _k cannot be faster than (*).     

Dielectric relaxation of ball-like labels in polyisoprene

Ball-like molecules with strong dipoles (labels) were mixed with synthetic polyisoprene (IR305) in low concentrations (<1%) and measured dielectrically in the frequency range 10^–2–10⁷ Hz and the temperature range –70–0°C (glass relaxation region). Calorimetric measurements showed that this type of label has a plasticizing effect on the polymeric matrix. The dielectric measurements showed that these ball-like molecules relax through cooperative rotations with the polymeric segments and at the same relaxation frequency. In addition, the label molecules showed a high-frequency local relaxation process. The relaxation strength ratio of the local process (X _local) to the total relaxation strength of the label was found to be dependent on the volume as well as on the shape of the label. A comparison between the relaxation behaviors of the ball-and rod-like molecules, having the same volume, showed that the length of the label is also an important parameter for the determination of the local contribution as well as of the cooperative relaxation mechanism of the label. The label relaxation process is discussed in relation to the molecular packing of the host polymer.     

Random walk in an inhomogeneous medium with local impurities

In spite of Sinai's result that the decay of the velocity autocorrelation function for a random walk on ^d (d=2) can drastically change if local impurities are present, it is shown that local impurities can not abolish weak convergence to the Brownian motion if d2.     

On the convergence of the LJ search method

The convergence of the Luus-Jaakola search method for unconstrained optimization problems is established.Notation E _n Euclideann-space - f Gradient off(x) - ² f Hessian matrix - (·) ^T Transpose of (·) - I Index set {1, 2, ...,n} - [x _i1 ^*(j) ] Point around which search is made in the (j + 1)th iteration, i.e., [x _1l ^*(j) ,x _2l ^*(j) ,...,x _n1 ^*(j) ] - r _i ⁽ⁱ⁾ Range ofx _il ^*(i) in the (j + 1)th iteration - l ₁ min_i {r _i ⁽⁰⁾ } - l ₂ min_i {r _i ⁽⁰⁾ } - A _j Region of search in thejth iteration, i.e., {x E _n:x _il ^*(j-1) –0.5r _i ^(j-1) x _ix _il ^*(j-1) +0.5r _i ^(j-1) ,i I} - S _j Closed sphere with center origin and radius _j - Reduction factor in each iteration - 1– - (·) Gamma function Many discussions with Dr. S. N. Iyer, Professor of Electrical Engineering, College of Engineering, Trivandrum, India, are gratefully acknowledged. The author has great pleasure to thank Dr. K. Surendran, Professor, Department of Electrical Engineering, P.S.G. College of Technology, Coimbatore, India, for suggesting this work.     

Properties of the random search in global optimization

From theorems which we prove about the behavior of gaps in a set ofN uniformly random points on the interval [0, 1], we determine properties of the random search procedure in one-dimensional global optimization. In particular, we show that the uniform grid search is better than the random search when the optimum is chosen using the deterministic strategy, that a significant proportion of large gaps are contained in the uniformly random search, and that the error in the determination of the point at which the optimum occurs, assuming that it is unique, will on the average be twice as large using the uniformly random search compared with the uniform grid. In addition, some of the properties of the largest gap are verified numerically, and some extensions to higher dimensions are discussed. The latter show that not all of the conclusions derived concerning the inadequacies of the one-dimensional random search extend to higher dimensions, and thaton average the random search is better than the uniform grid for dimensions greater than 6.This paper is based on work started in the Statistics Department of Princeton University when the first author was visiting as a Research Associate. Part of this research was supported by the Office of Naval Research, Contract No. 0014-67-A-0151-0017, and by the US Army Research Office—Durham, Contract No. DA-31-124-ARO-D-215.2 The authors wish to thank B. Omodei for his careful work in preparing the programs for the results of Figs. 1–2 and Table 1. The computations were performed on the IBM 360/50 of the Australian National University's Computer Centre. Thanks are also due to R. Miles for suggestions regarding the extension of the results to multidimensional regions, and to P. A. P. Moran and R. Brent for suggestions regarding the evaluation of the integral ₀ ¹ ... ^0/1 (x ₁ ² + ... +x _n ^/2 )^1/2 dx ₁ ...dx _n.     

On the nonlinear stochastic realization problem

In this paper we construct a first solution of the stochastic realization problem in a nonlinear setting. The great bulk of previous work on stochastic realization has been in the linear Gaussian setting. Such Markovian representations are used e.g., to apply certain filtering and stochastic control techniques. Our methods consist of an amalgamation of methods introduced by Nelson with the Lax-Phillips type geometric approach to linear Gaussian stochastic realization which has been developed by Lindquist and Picci and by Ruckebusch. The result of this that we are able to realize any purely nondeterministic process satisfying suitable continuity conditions as an instantaneous function of a Markov process.     

Local existence-uniqueness and continuation of solutions for delay stochastic evolution equations

In this article, we consider dynamic behaviours of a class of non-linear delay stochastic evolution equations. Local existence and uniqueness of the solutions are obtained with the aid of proper iterative scheme and moment estimations. We also propose a continuation result and our results generalize the known results.     

On the Rayleigh-Plateau instability

In this paper,we study the surface instability of a cylindrical pore in the absence of stress. This instability is called the Rayleigh-Plateau instabilty. We consider the model developed by Spencer et ...